summary:The following result is proved: Let $G$ be a connected graph of order $geq 4$. Then for every matching $M$ in $G^4$ there exists a hamiltonian cycle $C$ of $G^4$ such that $E(C)\bigcap M=0$.
展开▼
机译：摘要：证明了以下结果：假设$ G $是订单$ geq 4 $的连通图。然后，对于$ G ^ 4 $中的每个匹配$ M $，存在一个$ G ^ 4 $的哈密顿循环$ C $，使得$ E（C）\ bigcap M = 0 $。
展开▼
